منابع مشابه
Tree Morphisms and Bisimulations
A category of action labelled trees is de ned that can be used to model unfolding of labelled transition systems and to study behavioural relations over them In this paper we study ve di erent equivalences based on bisimulation for our model One that we called resource bisimulation amounts essentially to three isomorphism An other its weak counterpart permits abstracting from silent actions whi...
متن کاملFrankowski BISIMULATIONS AND p - MORPHISMS
One of the fundamental notions of model theory for modal logics is a bisimulation. Indeed it not only preserves logical value of formulas but it plays the important role for the modal definable classes of models ([2]). The main scope of the paper is to present several types of bisimulations that are proper for the different types of model structures – ordinary Kripke models, their many-valued c...
متن کاملTree-functors, determinacy and bisimulations
We study the functorial characterization of bisimulation-based equivalences over a categorical model of labeled trees. We show that, in a setting where all labels are visible, strong bisimilarity can be characterized in terms of enriched functors by relying on reflection of paths with their factorizations. For an enriched functor F , this notion requires that a path (an internal morphism in our...
متن کاملRational Tree Morphisms and Transducer Integer Sequences: Definition and Examples
The notion of transducer integer sequences is considered through a series of examples (the chosen examples are related to the Tower of Hanoi problem on 3 pegs). By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite transducers encoding rational tree morphisms (length and prefix preserving transformations of words that have only fi...
متن کاملBisimulations, Games and Logic
In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1998
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80249-x